13 research outputs found

    Energy Cooperation in Energy Harvesting Communication Systems

    Get PDF
    In energy harvesting communications, users transmit messages using energy harvested from nature. In such systems, transmission policies of the users need to be carefully designed according to the energy arrival profiles. When the energy management policies are optimized, the resulting performance of the system depends only on the energy arrival profiles. In this dissertation, we introduce and analyze the notion of energy cooperation in energy harvesting communications where users can share a portion of their harvested energy with the other users via wireless energy transfer. This energy cooperation enables us to control and optimize the energy arrivals at users to the extent possible. In the classical setting of cooperation, users help each other in the transmission of their data by exploiting the broadcast nature of wireless communications and the resulting overheard information. In contrast to the usual notion of cooperation, which is at the signal level, energy cooperation we introduce here is at the battery energy level. In a multi-user setting, energy may be abundant in one user in which case the loss incurred by transferring it to another user may be less than the gain it yields for the other user. It is this cooperation that we explore in this dissertation for several multi-user scenarios, where energy can be transferred from one user to another through a separate wireless energy transfer unit. We first consider the offline optimal energy management problem for several basic multi-user network structures with energy harvesting transmitters and one-way wireless energy transfer. In energy harvesting transmitters, energy arrivals in time impose energy causality constraints on the transmission policies of the users. In the presence of wireless energy transfer, energy causality constraints take a new form: energy can flow in time from the past to the future for each user, and from one user to the other at each time. This requires a careful joint management of energy flow in two separate dimensions, and different management policies are required depending on how users share the common wireless medium and interact over it. In this context, we analyze several basic multi-user energy harvesting network structures with wireless energy transfer. To capture the main trade-offs and insights that arise due to wireless energy transfer, we focus our attention on simple two- and three-user communication systems, such as the relay channel, multiple access channel and the two-way channel. Next, we focus on the delay minimization problem for networks. We consider a general network topology of energy harvesting and energy cooperating nodes. Each node harvests energy from nature and all nodes may share a portion of their harvested energies with neighboring nodes through energy cooperation. We consider the joint data routing and capacity assignment problem for this setting under fixed data and energy routing topologies. We determine the joint routing of energy and data in a general multi-user scenario with data and energy transfer. Next, we consider the cooperative energy harvesting diamond channel, where the source and two relays harvest energy from nature and the physical layer is modeled as a concatenation of a broadcast and a multiple access channel. Since the broadcast channel is degraded, one of the relays has the message of the other relay. Therefore, the multiple access channel is an extended multiple access channel with common data. We determine the optimum power and rate allocation policies of the users in order to maximize the end-to-end throughput of this system. Finally, we consider the two-user cooperative multiple access channel with energy harvesting users. The users cooperate at the physical layer (data cooperation) by establishing common messages through overheard signals and then cooperatively sending them. For this channel model, we investigate the effect of intermittent data arrivals to the users. We find the optimal offline transmit power and rate allocation policy that maximize the departure region. When the users can further cooperate at the battery level (energy cooperation), we find the jointly optimal offline transmit power and rate allocation policy together with the energy transfer policy that maximize the departure region

    Energy harvesting cooperative diamond channel

    No full text
    Abstract—We consider the energy harvesting diamond channel, where the source and two relays harvest energy from nature. The physical layer is modeled as a concatenation of a broadcast and a multiple access channel. We find the optimal offline transmit power and rate allocations that maximize the end-to-end throughput. First, we show that there exists an optimal source power allocation which is equal to the single-user optimal power allocation for the source energy arrivals and does not depend on the relay energy arrivals. Second, we show that the fraction of the power spent on each broadcast link depends on the energy arrivals for the relays. Specifically, we show that the optimal source rate allocation can be found by solving an optimal broadcasting problem with slot-dependent user priorities and these priorities can change only at instants where one of the relay data buffers is empty. Finally, we decompose the problem into inner and outer optimization problems and solve the overall problem by iterating between the two. I

    Optimal Energy and Data Routing in Networks With Energy Cooperation

    No full text

    CFAR processing with switching exponential smoothers for nonhomogeneous environments

    No full text
    Conventional constant false alarm rate (CFAR) methods use a fixed number of cells to estimate the background variance. For homogeneous environments, it is desirable to increase the number of cells, at the cost of increased computation and memory requirements, in order to improve the estimation performance. For nonhomogeneous environments, it is desirable to use less number of cells in order to reduce the number of false alarms around the clutter edges. In this work, we present a solution with two exponential smoothers (first order IIR filters) having different time-constants to leverage the conflicting requirements of homogeneous and nonhomogeneous environments. The system is designed to use the filter having the large time-constant in homogeneous environments and to promptly switch to the filter having the small time constant once a clutter edge is encountered. The main advantages of proposed Switching IIR CFAR method are computational simplicity, small memory requirement (in comparison to windowing based methods) and its good performance in homogeneous environments (due to the large time-constant smoother) and rapid adaptation to clutter edges (due to the small time-constant smoother)

    Energy and Data Cooperative Multiple Access Channel With Intermittent Data Arrivals

    No full text

    Energy cooperation in energy harvesting wireless communications

    No full text
    Abstract—We consider a simple multi-hop communication scenario composed of a source node, a relay node and a destination node where the source and the relay can harvest energy from the nature. Energy required for communication arrives (is harvested) at the transmitter and an unlimited battery stores it before being consumed for transmission. In addition, the source can assist the relay by transferring a portion of its energy to the relay through a separate energy transfer unit. We address this energy cooperation between the source and the relay in a deterministic setting. Assuming that the source and the relay nodes are informed of the energy arrivals in advance, we find jointly optimal offline energy management policies for the source and the relay that maximize the end-to-end throughput. We show that this problem is a convex problem. In order to gain insight about the structure of the solution, we consider specific scenarios. In particular, we show that if the relay energy profile is higher at the beginning and lower at the end with only one intersection, then matching the power sequences of the source and the relay slot-by-slot is optimal. We also consider the case when the energy of the source is available at the beginning and show that transferring energy in the first slot is optimal. I

    Energy Cooperation in Energy Harvesting Two-Way Communications

    No full text
    Abstract—In this paper, we investigate a two-way communication channel where users can harvest energy from nature and energy can be transferred in one-way from one of the users to the other. Energy required for data transmission is randomly harvested by the users throughout the communication duration and users have unlimited batteries to store energy for future use. In addition, there is a separate wireless energy transfer unit that facilitates energy transfer only in one-way and with efficiency α. We study the energy cooperation made possible by wireless energy transfer in the two-way channel. Assuming that both users know the energy arrivals in advance, we find jointly optimal offline energy management policies that maximize the sum throughput of the users. We show that this problem is a convex optimization problem, and find the solution by a generalized two-dimensional directional water-filling algorithm which transfers energy from one user to another while maintaining that the energy is allocated in the time dimension optimally. Optimal solution equalizes the energy levels as much as possible both among users and among slots, permitted by causality constraints of the energy arrivals and one-way energy transfer. I

    Two-way and multipleaccess energy harvesting systems with energy cooperation

    No full text
    Abstract—We study the capacity regions of two-way and multiple-access energy harvesting communication systems with one-way wireless energy transfer. In these systems, energy required for data transmission is harvested by the users from nature throughout the communication duration, and there is a separate unit that enables energy transfer from the first user to the second user with an efficiency of α. Energy harvests are known by the transmitters a priori. We first investigate the capacity region of the energy harvesting Gaussian two-way channel (TWC) with one-way energy transfer. We show that the boundary of the capacity region is achieved by a generalized two-dimensional directional water-filling algorithm. Then, we study the capacity region of the energy harvesting Gaussian multiple access channel (MAC) with one-way energy transfer. We show that if the priority of the first user is higher, then energy transfer is not needed. In addition, if the priority of the second user is sufficiently high, then the first user must transfer all of its energy to the second user. I
    corecore